Visual Clustering of Graphs with Nonuniform Degrees
نویسنده
چکیده
We discuss several criteria for clustering graphs, and identify two criteria which are not biased towards certain cluster sizes: the node-normalized cut (also called cut ratio) and the edge-normalized cut. We present two energy models whose minimum energy drawings reveal clusters with respect to these criteria. The energy model that corresponds to the edge-normalized cut differs from the other energy model in that it is also useful for graphs with very nonuniform node degrees. We show that its drawings provide insights into the structure of an airline routing graph, a citation graph, a social network, and a thesaurus graph.
منابع مشابه
Energy-Based Clustering of Graphs with Nonuniform Degrees
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is of great practical interest, as these clusters may correspond to cohesive software modules, semantically related documents, and groups of friends or collaborators. Many existing clustering criteria and energy models a...
متن کاملEfficient Algorithms for Sampling and Clustering of Large Nonuniform Networks
We propose efficient algorithms for two key tasks in the analysis of large nonuniform networks: uniform node sampling and cluster detection. Our sampling technique is based on augmenting a simple, but slowly mixing uniform MCMC sampler with a regular random walk in order to speed up its convergence; however the combined MCMC chain is then only sampled when it is in its “uniform sampling” mode. ...
متن کاملOn existence of triangles, clustering, and small-world property of random key graphs
Random key graphs have been introduced about a decade ago in the context of key predistribution schemes for securing wireless sensor networks (WSNs). They have received much attention recently with applications spanning the areas of recommender systems, epidemics in social networks, cryptanalysis, and clustering and classification analysis. This paper is devoted to analyzing various properties ...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملA study on some properties of leap graphs
In a graph G, the first and second degrees of a vertex v is equal to thenumber of their first and second neighbors and are denoted by d(v/G) andd 2 (v/G), respectively. The first, second and third leap Zagreb indices are thesum of squares of second degrees of vertices of G, the sum of products of second degrees of pairs of adjacent vertices in G and the sum of products of firs...
متن کامل